Partial inverse assignment problems under l1 norm
نویسندگان
چکیده
In this paper, we consider the partial inverse assignment problem under l1 norm without bound constraints. We show that the partial inverse problem can be solved by a strongly polynomial algorithm. The technique for solving this problem can be extended to handle a special type of partial inverse 0.1 combinatorial optimization problems. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Combinatorial algorithms for inverse network flow problems
An inverse optimization problems is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and xO be a given feasible solution. We want to perturb the cost vector c to d so that x is an optimal solution of P with respect to the cost vector d , and lid clip is minimum, where 11.llp denotes some selected Lp norm. In this pape...
متن کاملInverse Optimization
In this paper, we study inverse optimization problems defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x0 be a given feasible solution. The solution x0 may or may not be an optimal solution of P with respect to the cost vector c. The inverse optimization problem is to perturb the cost vector c to d so that x0 is a...
متن کاملOn Inverse Problems of Optimum Perfect Matching
As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l1 or l∞ norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l1 and l∞ norms. It has been proved that the inverse maximum-we...
متن کاملSelected partial inverse combinatorial optimization problems with forbidden elements
We study the computational complexity of some special partial inverse combinatorial optimization problems where the goal is to change a parameter at minimum cost such that there exists an optimal solution for the underlying combinatorial optimization problem with respect to the modified parameter that does not contain a prespecified set of forbidden elements. We show that the partial inverse pr...
متن کاملSome inverse min-max network problems under weighted l1 and linfinity norms with bound constraints on changes
We consider some inverse min-max (or max-min) network problems. Such an inverse problem is to modify the weights with bound constraints so that a given feasible solution becomes an optimal solution of a min-max (or max-min) network problem, and the deviation of the weights, measured by the weighted l1 norm or weighted l∞ norm, is minimum. In this paper, we present strongly polynomial time algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 2007